BROADCASTS ON OPHTHALMOLOGICAL SUBJECTS

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reconstructing Broadcasts on Trees

Given a branching Markov process on a tree, the goal of the reconstruction (or “broadcast”) problem is to guess the initial condition at the root, given the states of the leaves. In this essay, we evaluate the performance of some algorithms, new and old, for solving the reconstruction problem.

متن کامل

Neuro-ophthalmological disorders in HIV infected subjects with neurological manifestations.

AIMS To determine the frequency and features of neuro-ophthalmological manifestations in neurologically symptomatic HIV infected patients and to assess whether or not the visual evoked potential (VEP) features in these patients differ from those of neurologically asymptomatic HIV infected patients. METHODS Neuro-ophthalmological evaluation was performed in 166 neurologically symptomatic confi...

متن کامل

Facebook (A)Live? Are live social broadcasts really broadcasts?

The era of live-broadcast is back but with two major changes. First, unlike traditional TV broadcasts, content is now streamed over the Internet enabling it to reach a wider audience. Second, due to various user-generated content platforms it has become possible for anyone to get involved, streaming their own content to the world. This emerging trend of going live usually happens via social pla...

متن کامل

Dynamic Skyscraper Broadcasts for Video-on-Demand

Skyscraper Broadcasting is a recently proposed statically scheduled broadcast technique for video-on-demand that addresses the network-I/O bottleneck to provide signiicantly superior performance over previous approaches. This paper deenes a scheme for dynamically scheduling the objects that are broadcast on the skyscraper channels. The dynamic broadcasting scheme is designed to provide all clie...

متن کامل

Broadcasts in graphs

We say that a function f : V → {0, 1, . . . , diam(G)} is a broadcast if for every vertex v ∈ V , f(v) ≤ e(v), where diam(G) denotes the diameter of G and e(v) denotes the eccentricity of v. The cost of a broadcast is the value f(V ) = Σv∈V f(v). In this paper we introduce and study the minimum and maximum costs of several types of broadcasts in graphs, including dominating, independent and eff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: British Journal of Ophthalmology

سال: 1937

ISSN: 0007-1161

DOI: 10.1136/bjo.21.8.459